Lower bounds for decomposable univariate wild polynomials
نویسندگان
چکیده
منابع مشابه
Lower bounds for univariate polynomials : a Wronskian approach
This is the nal report of an internship in algebraic complexity. First, we give an introduction to algebraic complexity and we give some motivations for the study of the main model. Then we present two di erent tools we studied during this internship and use them to establish some lower bounds on this model. We nally discuss whether those bounds could be improved or not.
متن کاملThe Number of Decomposable Univariate Polynomials
A univariate polynomial f over a field is decomposable if it is the composition f = g ◦h of two polynomials g and h whose degree is at least 2. We determine an approximation to the number of decomposable polynomials over a finite field. The tame case, where the field characteristic p does not divide the degree n of f , is reasonably well understood, and we obtain exponentially decreasing error ...
متن کاملThe number of decomposable univariate polynomials
A univariate polynomial f over a field is decomposable if it is the composition f = g ◦h of two polynomials g and h whose degree is at least 2. We determine an approximation to the number of decomposable polynomials over a finite field. The tame case, where the field characteristic p does not divide the degree n of f , is reasonably well understood, and we obtain exponentially decreasing error ...
متن کاملBounds for resultants of univariate and bivariate polynomials
Article history: Received 23 August 2008 Accepted 3 August 2009 Available online xxxx Submitted by V. Olshevsky AMS classification: 11C20 11S05 15A60 13F20
متن کاملOn Bounds For The Zeros of Univariate Polynomials
Problems on algebraical polynomials appear in many fields of mathematics and computer science. Especially the task of determining the roots of polynomials has been frequently investigated. Nonetheless, the task of locating the zeros of complex polynomials is still challenging. In this paper we deal with the location of zeros of univariate complex polynomials. We prove some novel upper bounds fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2013
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2011.01.008